منابع مشابه
Admissibility and common belief
The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all opponent strategies or on the union of the choice sets that are deemed possible for the oppo...
متن کاملCommon reasoning about admissibility
We analyze common reasoning about admissibility in the strategic and extensive form of a game. We define a notion of sequential proper admissibility in the extensive form, and show that, in finite extensive games with perfect recall, the strategies that are consistent with common reasoning about sequential proper admissibility in the extensive form are exactly those that are consistent with com...
متن کاملCommon Knowledge and Common Belief
Philosopher: Today, I suggest we discuss the important concepts of common knowledge and common belief. As far as I know, the first one to give a formal analysis of these concepts was the philosopher David Lewis, in his book Convention [131]. One of his examples is traffic conventions, about the role of common knowledge in how one behaves in road traffic. To explain this properly, I wonder if yo...
متن کاملCommon belief and common knowledge
But game theory as we presently know it can not proceed without the fulcrum of common knowledge. Robert Wilson (1985) In the universal belief space [Mertens and Zamir (1985)] which incorporated all situations of incomplete information concerning a state space S , we de ne a `knowledge operator' in terms of beliefs. From this operator we derive (in the usual way) the concept of common knowledge ...
متن کاملLinear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent’s knowledge in non-transitive temporal linear logic LTLPast,m. We find algorithms solving mentioned problems, justify our approach to consider linear non-transitive time with several examples. Main, most complicated, technical new result is it decidability of LTLPa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 1997
ISSN: 1556-5068
DOI: 10.2139/ssrn.1186